A New Test for Hamming-Weight Dependencies
نویسندگان
چکیده
We describe a new statistical test for pseudorandom number generators (PRNGs). Our can find bias induced by dependencies among the Hamming weights of outputs PRNG, even PRNGs that pass state-of-the-art tests same kind from literature, and particularly based on F 2 -linear transformations such as dSFMT [ 22 ], xoroshiro1024+ 1 WELL512 19 ].
منابع مشابه
Computation of Minimum Hamming Weight for Linear Codes
In this paper, we consider the minimum Hamming weight for linear codes over special finite quasi-Frobenius rings. Furthermore, we obtain minimal free $R$-submodules of a finite quasi-Frobenius ring $R$ which contain a linear code and derive the relation between their minimum Hamming weights. Finally, we suggest an algorithm that computes this weight using the Grobner basis and we show that und...
متن کاملa new approach to credibility premium for zero-inflated poisson models for panel data
هدف اصلی از این تحقیق به دست آوردن و مقایسه حق بیمه باورمندی در مدل های شمارشی گزارش نشده برای داده های طولی می باشد. در این تحقیق حق بیمه های پبش گویی بر اساس توابع ضرر مربع خطا و نمایی محاسبه شده و با هم مقایسه می شود. تمایل به گرفتن پاداش و جایزه یکی از دلایل مهم برای گزارش ندادن تصادفات می باشد و افراد برای استفاده از تخفیف اغلب از گزارش تصادفات با هزینه پائین خودداری می کنند، در این تحقیق ...
15 صفحه اولCoding Circuits for Reducing Hamming Weight
Using a newly introduced alternative to a conventional SRAM cell a binary zero can be written with a much lower power consumption than a binary one. Such a solution reduces power consumption, especially if there are few ones in the data, that is, if the data has a low Hamming weight. If the data is not inherently of low weight, this can be achieved by encoding the data. In the paper such coding...
متن کاملWeight Distributions of Hamming Codes
We derive a recursive formula determining the weight distribution of the [n = (qm − 1)/(q − 1), n − m, 3] Hamming code H(m, q), when (m, q−1) = 1. Here q is a prime power. The proof is based on Moisio’s idea of using Pless power moment identity together with exponential sum techniques.
متن کاملInteger Addition and Hamming Weight
We study the effect of addition on the Hamming weight of a positive integer. Consider the first 2n positive integers, and fix an α among them. We show that if the binary representation of α consists of Θ(n) blocks of zeros and ones, then addition by α causes a constant fraction of low Hamming weight integers to become high Hamming weight integers. This result has applications in complexity theo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Modeling and Computer Simulation
سال: 2022
ISSN: ['1049-3301', '1558-1195']
DOI: https://doi.org/10.1145/3527582